Straight Skeleton Implementation

نویسنده

  • Petr Felkel
چکیده

Straight skeleton (Angular Bisector Network, ABN) of a planar polygon, which can be grasped as a modi cation of a planar Voronoi diagram without parabolic arcs, has been successfully used by Oliva et al. [5] as a part of a system for three dimensional reconstruction of objects from a given set of 2D contours in parallel cross sections. The algorithm itself is used for the construction of intermediate contour layers during the reconstruction process, in order not to create self intersected surface triangles or a surface with holes. But { Oliva's algorithm is not publicly available and we have not found any other useful code on the net. We have followed our older ideas [4] and implemented our version of straight skeleton. Our algorithm runs in O(nm+ n log n) time, where n denotes the total number of polygon vertices and m the number of re ex ones.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Mitered Offset Curves Based on Straight Skeletons

We study the practical computation of mitered and beveled offset curves of planar straight-line graphs (PSLGs), i.e., of arbitrary collections of straight-line segments in the plane that do not intersect except possibly at common end points. The line segments can, but need not, form polygons. Similar to Voronoi-based offsetting, we propose to compute a straight skeleton of the input PSLG as a p...

متن کامل

A Fast Straight-Skeleton Algorithm Based on generalized Motorcycle Graphs

This paper deals with the fast computation of straight skeletons of planar straightline graphs (PSLGs) at an industrial-strength level. We discuss both the theoretical foundations of our algorithm and the engineering aspects of our implementation Bone. Our investigation starts with an analysis of the triangulation-based algorithm by Aichholzer and Aurenhammer and we prove the existence of flip-...

متن کامل

On Computing Straight Skeletons by Means of Kinetic Triangulations

We study the computation of the straight skeleton of a planar straight-line graph (PSLG) by means of the triangulation-based wavefront propagation proposed by Aichholzer and Aurenhammer in 1998, and provide both theoretical and practical insights. As our main theoretical contribution we explain the algorithmic extensions and modifications of their algorithm necessary for computing the straight ...

متن کامل

Approximating a Motorcycle Graph by a Straight Skeleton

We investigate how a straight skeleton can be used to approximate a motorcycle graph. We explain how to construct a planar straight-line graph G such that the straight skeleton of G reveals the motorcycle graph of M , for every given finite set M of motorcycles. An application of our construction is a proof of the Pcompleteness of the construction problem of straight skeletons of planar straigh...

متن کامل

Skeleton computation of orthogonal polyhedra

Skeletons are powerful geometric abstractions that provide useful representations for a number of geometric operations. The straight skeleton has a lower combinatorial complexity compared with the medial axis. Moreover, while the medial axis of a polyhedron is composed of quadric surfaces the straight skeleton just consist of planar faces. Although there exist several methods to compute the str...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998